import com.sun.org.apache.bcel.internal.generic.SWAP;

public class Test {
    public static void main(String[] args) {
        void func(int N){
            int count = 0;
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < N; j++) {
                    count++;
                }
            }
            for(int k = 0;k < 2 * N;k++){
                count++;
            }

            int M = 10;
            while((M--) > 0){
                count++;
            }
            System.out.println(count);
        }

        void func2(int N){
            int count = 0;
            for (int i = 0; i < 2 * N; i++) {
                count++;
            }
            int M = 10;
            while((M--) > 0){
                count++;
            }
            System.out.println(count);
        }
        void func3(int N,int M){
            int count = 0;
            for (int i = 0; i < M; i++) {
                count++;
            }
            for (int i = 0; i < N; i++) {
                count++;
            }
            System.out.println(count);
        }
        void func4(int N){
            int count = 0;
            for (int i = 0; i < 100; i++) {
                count++;
            }
            System.out.println(count);
        }
        void bubbleSort(int[] array){
            for (int end = args.length; end > 0; end--) {
                boolean sorted = true;
                for (int i = 1; i < end; i++) {
                    if(array[i - 1] > array[i]){
                        Swap(array,i - 1,i);
                        sorted = false;
                    }
                }
                if(sorted == true){
                    break;
                }
            }
        }
        int binarySearch(int[] array, int value){
            int begin = 0;
            int end = array.length - 1;
            while(begin <= end){
                int mid = begin + ((end-begin)/2);
                if(array[mid] < value){
                    begin = mid+1;
                }else if(array[mid] > mid){
                    end = mid -1;
                }else
                    return mid;
            }
            return -1;
        }
        long factorial(int N) {
            return N < 2 ? N : factorial(N-1) * N;
        }
        int fibonacci(int N) {
            return N < 2 ? N : fibonacci(N-1)+fibonacci(N-2);
        }
    }
}